Maximum weight matching with hysteresis in overloaded queues with setups
نویسندگان
چکیده
We consider a system of parallel queues where arriving service tasks are buffered, according to type. Available service resources are dynamically configured and allocated to the queues to process the tasks. At each point in time, a scheduler chooses a service configuration across the queues, in response to queue backlogs. Switching from one service configuration to another incurs a setup time, during which idling occurs and service bandwidth is lost. Such setup times are inherent in manufacturing and computer systems. Frequent switchings can significantly compromise the service capacity of such systems. A Maximum Weight Matching (MWM) scheduler, which is known to maximize throughput in the absence of setups, can easily go unstable with setups, even under low load. To remedy this problem, we propose a new MWM-H scheduler which utilizes a controller introduced Hysteresis and achieves maximum throughput even with setups, without requiring knowledge of arrival rates and average traffic loads. During prolonged traffic bursts, the queues may become overloaded and the issue becomes how to reasonably distribute the growing backlog under MWM-H. It is shown that by appropriately selecting the MWM-H parameters, one can control the backlog amongst the individual queues in order to achieve a desired balance.
منابع مشابه
Achieving 100% Throughput in an Input-Queued Switch
Abstract — It is well known that head-of-line (HOL) blocking limits the throughput of an input-queued switch with FIFO queues. Under certain conditions, the throughput can be shown to be limited to approximately 58%. It is also known that if non-FIFO queueing policies are used, the throughput can be increased. However, it has not been previously shown that if a suitable queueing policy and sche...
متن کاملFluid models of congestion collapse in overloaded switched networks
We consider a switched network (i.e. a queueing network in which there are constraints on which queues may be served simultaneously), in a state of overload. We analyse the behaviour of two scheduling algorithms for multihop switched networks: a generalized version of max-weight, and the α-fair policy. We show that queue sizes grow linearly with time, under either algorithm, and we characterize...
متن کاملThe matching interdiction problem in dendrimers
The purpose of the matching interdiction problem in a weighted graph is to find two vertices such that the weight of the maximum matching in the graph without these vertices is minimized. An approximate solution for this problem has been presented. In this paper, we consider dendrimers as graphs such that the weights of edges are the bond lengths. We obtain the maximum matching in some types of...
متن کاملWeight Measurements by Using Simple Optical-Fiber Sensors (RESEARCH NOTE)
The use of different optical-fiber sensors for weighing measurements is Abstract described. By using three different mechanical stressing mechanisms, the operation of the fiber-to-fiber transducer systems are tested and the results are presented. Parameters such as sensitivity, hysteresis, resolution, and dynamic range are measured. A comparison of the results has shown that the sensor system m...
متن کاملMany-server diffusion limits for G/Ph/n + GI queues
This paper studies many-server limits for multi-server queues that have a phasetype service time distribution and allow for customer abandonment. The first set of limit theorems is for critically loaded G/Ph/n + GI queues, where the patience times are independent, identically distributed following a general distribution. The next limit theorem is for overloaded G/Ph/n + M queues, where the pati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Queueing Syst.
دوره 82 شماره
صفحات -
تاریخ انتشار 2016